Computing maximum non-crossing matching in convex bipartite graphs
نویسندگان
چکیده
منابع مشابه
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = (A;B;E). For p processors with N=p memory per processor, N = jAj+ jBj, N=p p, the algorithm requires O(log p) communication rounds and O(Tsequ(np ; m p ) + n p log p) local computation, where n = jAj, m = jBj and Tsequ(n;m) is the sequential time complexity for the problem. For the BS...
متن کاملMaximum semi-matching problem in bipartite graphs
An (f, g)-semi-matching in a bipartite graph G = (U ∪V,E) is a set of edges M ⊆ E such that each vertex u ∈ U is incident with at most f(u) edges of M , and each vertex v ∈ V is incident with at most g(v) edges of M . In this paper we give an algorithm that for a graph with n vertices and m edges, n ≤ m, constructs a maximum (f, g)semi-matching in running time O(m ·min( √∑ u∈U f(u), √∑ v∈V g(v)...
متن کاملParallel Maximum Independent Set in Convex Bipartite Graphs
A bipartite graph G = (V;W; E) is called convex if the vertices in W can be ordered in such a way that the elements of W adjacent to any vertex v 2 V form an interval (i.e. a sequence consecutively numbered vertices). Such a graph can be represented in a compact form that requires O(n) space, where n = maxfjV j; jW jg. Given a convex bipartite graph G in the compact form Dekel and Sahni designe...
متن کاملGeneralizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs
A two-rowed array αn = ( a1 a2 . . . an b1 b2 . . . bn ) is said to be in lexicographic order if ak ≤ ak+1 and bk ≤ bk+1 if ak = ak+1. A length ` (strictly) increasing subsequence of αn is a set of indices i1 < i2 < . . . < i` such that bi1 < bi2 < . . . < bi` . We are interested in the statistics of the length of the longest increasing subsequence of αn chosen according to Dn, for distinct fam...
متن کاملDetermining All Maximum Uniquely Restricted Matching in Bipartite Graphs
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.02.014